Constant Time Generation of Rooted and Colored Outerplanar Graphs
نویسندگان
چکیده
An outerplanar graph is a graph that admits a planar embedding such that all vertices appear on the boundary of its outer face. Given a positive integer n and a color set C with K > 0 colors, we consider the problem of enumerating all colored and rooted outerplanar graphs with at most n vertices without repetition. We design an efficient algorithm that can generate all required graphs in constant time per each and in linear space.
منابع مشابه
Generation of Symmetric and Asymmetric Biconnected Rooted Outerplanar Graphs
In a rooted graph, a vertex is designated as its root. An outerplanar graph is represented by a plane embedding such that all vertices appear along its outer boundary. Two different plane embeddings of a rooted outerplanar graphs are called symmetric copies. Given integers n ≥ 3 and g ≥ 3, we give an O(n)-space and O(1)-time delay algorithm that enumerates all biconnected rooted outerplanar gra...
متن کاملGenerating Outerplanar Graphs Uniformly at Random
We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a counting technique using the decomposition of a graph according to its block structure, and compute the exact number of labeled outerplanar graphs. This allows us to make the correct probabilistic choices in a recursiv...
متن کاملCanonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation
In this article we define a canonical decomposition of rooted outerplanar maps into a spanning tree and a list of edges. This decomposition, constructible in linear time in the Word-RAMmodel, implies the existence of bijection between rooted outerplanar maps with n nodes and bicolored rooted ordered trees with n nodes where all the nodes of the last branch are colored white. As a consequence, f...
متن کاملEmbedding K-outerplanar Graphs into 1 *
We show that the shortest-path metric of any k-outerplanar graph, for any fixed k, can be approximated by a probability distribution over tree metrics with constant distortion and hence also embedded into 1 with constant distortion. These graphs play a central role in polynomial time approximation schemes for many NP-hard optimization problems on general planar graphs and include the family of ...
متن کاملGraphs and colors : edge-colored graphs, edge-colorings and proper connections. (Graphes et couleurs : graphes arêtes-coloriés, coloration d'arêtes et connexité propre)
In this thesis, we study different problems in edge-colored graphs and edge-colored multigraphs, such as proper connection, strong edge colorings, and proper hamiltonian paths and cycles. Finally, we improve the known O(n) algorithm to decide the behavior of a graph under the biclique operator, by studying bicliques in graphs without false-twin vertices. In particular, • We first study the k-pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010